Competitive Paging with Locality of Reference
نویسندگان
چکیده
منابع مشابه
Truly Online Paging with Locality of Reference
The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access gr...
متن کاملOn Certain New Models for Paging with Locality of Reference
The competitive ratio is the most common metric in online algorithm analysis. Unfortunately, it produces pessimistic measures and often fails to distinguish between paging algorithms that have vastly differing performance in practice. An apparent reason for this is that the model does not take into account the locality of reference evidenced by actual input sequences. Therefore many alternative...
متن کاملFinely-Competitive Paging
We construct an online algorithm for paging that achieves an O(r + log k) competitive ratio when compared to an offline strategy that is allowed the additional ability to “rent” pages at a cost of 1=r. In contrast, the competitive ratio of the Marking algorithm for this scenario is O(r log k). Our algorithm can be thought of in the standard setting as having a “fine-grained” competitive ratio, ...
متن کاملCompetitive Paging Algorithms
*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer Science, Computer Science Division, University of California, Berkeley, CA 94720; ‘Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M6C 3B7; ‘Department of Mathematics and Computer Science, Amherst College, Amherst, Massachusetts 01002; “...
متن کاملOn Competitive On-Line Paging with Lookahead
This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm can use more pages; in the second, it is allowed to have a lookahead, or in other words, some partial knowledge of the future. The paper considers a new measure for the lookahead size as well as Young’s resource-bounded lookahead and proves that both measures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1021